منابع مشابه
A Random Walk through Eigenspace
It has been over a decade since the “Eigenfaces” approach to automatic face recognition, and other appearancebased methods, made an impression on the computer vision research community and helped spur interest in vision systems being used to support biometrics and human-computer interface. In this paper I give a personal view of the original motivation for the work, some of the strengths and li...
متن کاملTwo-site Quantum Random Walk
We study the measure theory of a two-site quantum random walk. The truncated decoherence functional defines a quantum measure μn on the space of n-paths, and the μn in turn induce a quantum measure μ on the cylinder sets within the space Ω of untruncated paths. Although μ cannot be extended to a continuous quantum measure on the full σ-algebra generated by the cylinder sets, an important questi...
متن کاملControlled random walk with a target site ∗
We consider a symmetric simple random walk {Wi} on Z, d = 1, 2, in which the walker may choose to stand still for a limited time. The time horizon is n, the maximum consecutive time steps which can be spent standing still is mn and the goal is to maximize P (Wn = 0). We show that for d = 1, if mn (logn) for some γ > 0, there is a strategy for each n yielding P (Wn = 0) → 1. For d = 2, if mn n f...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملBalanced Allocation Through Random Walk
We consider the allocation problem in which $m \leq (1-\ve) dn $ items are to be allocated to $n$ bins with capacity $d$. The items $x_1,x_2,\ldots,x_m$ arrive sequentially and when item $x_i$ arrives it is given two possible bin locations $p_i=h_1(x_i),q_i=h_2(x_i)$ via hash functions $h_1,h_2$. We consider a random walk procedure for inserting items and show that the expected time insertion t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2021
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.103.022114